General Theory and Tools for Proving Algorithms in Nominative Data Systems
نویسندگان
چکیده
منابع مشابه
Analyzing Tools and Algorithms for Privacy Protection and Data Security in Social Networks
The purpose of this research, is to study factors influencing privacy concerns about data security and protection on social network sites and its’ influence on self-disclosure. 100 articles about privacy protection, data security, information disclosure and Information leakage on social networks were studied. Models and algorithms types and their repetition in articles have been distinguished a...
متن کاملProving Properties of Programs on Hierarchical Nominative Data
In the paper we develop methods for proving properties of programs on hierarchical nominative data on the basis of the composition-nominative approach. In accordance with this approach, the semantics of a program is a function on nominative data constructed from basic operations using compositions (operations on functions) which represent programming language constructs. Nominative data can be ...
متن کاملTools for Proving Zero Knowledge Tools for Proving Zero Knowledge
We develop general techniques that can be used to prove the zero knowledge property of most of the known zero knowledge protocols. Those techniques consist in reducing the circuit indistinguishability of the output distributions of two probabilistic Turing machines to the indistinguishability of the output distributions of certain subroutines.
متن کاملApplication of Rough Set Theory in Data Mining for Decision Support Systems (DSSs)
Decision support systems (DSSs) are prevalent information systems for decision making in many competitive business environments. In a DSS, decision making process is intimately related to some factors which determine the quality of information systems and their related products. Traditional approaches to data analysis usually cannot be implemented in sophisticated Companies, where managers ne...
متن کاملTSTP Data-Exchange Formats for Automated Theorem Proving Tools
This paper describes two data-exchange formats for Automated Theorem Proving (ATP) tools. First, a language for writing the problems that are input to ATP systems, and for writing the solutions that are output from ATP systems, is described. Second, a hierarchy of values for specifying the logical status of an ATP problem, as may be established by an ATP system, is described. These data-exchang...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formalized Mathematics
سال: 2020
ISSN: 1898-9934
DOI: 10.2478/forma-2020-0024